Search results for "scalarizing function"

showing 4 items of 4 documents

A New Paradigm in Interactive Evolutionary Multiobjective Optimization

2020

Over the years, scalarization functions have been used to solve multiobjective optimization problems by converting them to one or more single objective optimization problem(s). This study proposes a novel idea of solving multiobjective optimization problems in an interactive manner by using multiple scalarization functions to map vectors in the objective space to a new, so-called preference incorporated space (PIS). In this way, the original problem is converted into a new multiobjective optimization problem with typically fewer objectives in the PIS. This mapping enables a modular incorporation of decision maker’s preferences to convert any evolutionary algorithm to an interactive one, whe…

050101 languages & linguisticsMathematical optimizationComputer sciencemedia_common.quotation_subjectdecision makerEvolutionary algorithmpäätöksentukijärjestelmätevoluutiolaskentapreference information02 engineering and technologySpace (commercial competition)Multi-objective optimizationoptimointiachievement scalarizing functionsalgoritmit0202 electrical engineering electronic engineering information engineering0501 psychology and cognitive sciencesQuality (business)evolutionary algorithmsFunction (engineering)media_commonbusiness.industry05 social sciencesinteractive methodsModular designDecision makermonitavoiteoptimointiPreference020201 artificial intelligence & image processingbusiness
researchProduct

Multi-scenario multi-objective robust optimization under deep uncertainty: A posteriori approach

2021

This paper proposes a novel optimization approach for multi-scenario multi-objective robust decision making, as well as an alternative way for scenario discovery and identifying vulnerable scenarios even before any solution generation. To demonstrate and test the novel approach, we use the classic shallow lake problem. We compare the results obtained with the novel approach to those obtained with previously used approaches. We show that the novel approach guarantees the feasibility and robust efficiency of the produced solutions under all selected scenarios, while decreasing computation cost, addresses the scenario-dependency issues, and enables the decision-makers to explore the trade-off …

Mathematical optimizationEnvironmental Engineering010504 meteorology & atmospheric sciencesComputer sciencepäätöksentekotehokkuus0211 other engineering and technologies02 engineering and technologyoptimaalisuus01 natural sciencesMulti-objective optimizationScenario planningRobust decision-makingdeep uncertaintyoptimointiRobustness (computer science)Reference pointsScenario planning0105 earth and related environmental sciencesscenario planningrobust decision making scalarizing functions021103 operations researchpareto-tehokkuusEcological ModelingPareto principleRobust optimizationskenaariotepävarmuusmonitavoiteoptimointireference pointsMulti-objective optimizationRobust decision making scalarizing functionsmulti-objective optimizationDeep uncertaintyBenchmark (computing)A priori and a posterioriSoftware
researchProduct

Hybrid evolutionary multi-objective optimization with enhanced convergence and diversity

2011

interactive evolutionary multi-objective optimizationNSGA-IIdifferential evolutionevoluutioalgoritmitPIEmultiple criteria decision makingmuuttujathybridialgoritmitmonitavoiteoptimointiEMO-algoritmitPareto-optimitNAUTILUS methodmutationhybrid frameworkachievement scalarizing function
researchProduct

Synchronous R-NSGA-II: An Extended Preference-Based Evolutionary Algorithm for Multi-Objective Optimization

2015

Classical evolutionary multi-objective optimization algorithms aim at finding an approx- imation of the entire set of Pareto optimal solutions. By considering the preferences of a decision maker within evolutionary multi-objective optimization algorithms, it is possible to focus the search only on those parts of the Pareto front that satisfy his/her preferences. In this paper, an extended preference-based evolutionary algorithm has been proposed for solving multi-objective optimiza- tion problems. Here, concepts from an interactive synchronous NIMBUS method are borrowed and combined with the R-NSGA-II algorithm. The proposed synchronous R-NSGA-II algorithm uses preference information provid…

ta113Mathematical optimizationinteractive multi-objective optimizationApplied MathematicsEvolutionary algorithmApproxDecision makerMulti-objective optimizationscalarizing functionSet (abstract data type)Pareto optimalevolutionary multi-objective optimizationpreference-based evolutionary algorithmsFocus (optics)Preference (economics)Information SystemsMathematicsInformatica
researchProduct